Reachability problems for communicating finite state machines
نویسنده
چکیده
1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability analysis and abstract flow control 6. Affine SR-machines 7. Undecidable problems 8. Rational channels for cyclic protocols 9. Recognizable channels for general protocols 10. Abstract flow control in general graphs 11. Recapitulation and conclusions Appendix: Post's tag systems This is a newly formatted version of the report. Page numbers differ from those in the original version. Several typographical errors have been corrected.
منابع مشابه
ar X iv : c s . L O / 0 30 61 21 v 1 2 2 Ju n 20 03 REACHABILITY PROBLEMS FOR COMMUNICATING FINITE STATE MACHINES * Jan
1. Introduction 2. Introductory examples 3. Communicating finite state machines 4. Reachability properties 5. Reachability analysis and abstract flow control 6. Affine SR-machines 7. Undecidable problems 8. Rational channels for cyclic protocols 9. Recognizable channels for general protocols 10. Abstract flow control in general graphs 11. Recapitulation and conclusions Appendix: Post's tag syst...
متن کاملCommunicating Hierarchical State Machines
Hierarchical state machines are nite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very little is known concerning their complexity and expressiveness. In this paper, we study these questions for hierarchical state machines as well as for communicating hierarchical state machines, that is, nite state machin...
متن کاملGlobal State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines
We present a novel propositional encoding for the reachability problem of communicating state machines. The problem deals with the question whether there is a path to some combination of states in a state machine view starting from a given configuration. Reachability analysis finds its application in many verification scenarios. By using an encoding inspired by approaches to encode planning pro...
متن کاملReverse Reachability Analysis a New Technique for Deadlock Detection on Communicating Finite State Machines
The communicating finite state machines can exchange messages over bounded FIFO channels. In this paper, a new technique, called reverse reachability analysis, is proposed to detect deadlocks on the communication between the communicating finite state machines. The technique is based on finding reverse reachable paths starting from possible deadlock states. If a reverse reachable path can reach...
متن کاملSafety Verification of Communicating One-Counter Machines
In order to verify protocols that tag messages with integer values, we investigate the decidability of the reachability problem for systems of communicating one-counter machines. These systems consist of local one-counter machines that asynchronously communicate by exchanging the value of their counters via, a priori unbounded, Fifo channels. This model extends communicating finite-state machin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره cs.LO/0306121 شماره
صفحات -
تاریخ انتشار 1982